A Polynomial-based Nonlinear Least Squares Optimized Preconditioner for Continuous and Discontinuous Element-based Discretizations of the Euler Equations
نویسنده
چکیده
We introduce a method for constructing a polynomial preconditioner using a nonlinear least squares (NLLS) algorithm. We show that this polynomial-based NLLS-optimized (PBNO) preconditioner significantly improves the performance of 2-D continuous Galerkin (CG) and discontinuous Galerkin (DG) fluid dynamical research models when run in an implicit-explicit time integration mode. When employed in a serially computed Schurcomplement form of the 2-D CG model with positive definite spectrum, the PBNO preconditioner achieves greater reductions in GMRES iterations and model wall-clock time compared to the analogous linear least-squares-derived Chebyshev polynomial preconditioner. Whereas constructing a Chebyshev preconditioner to handle the complex spectrum of the DG model would introduce an element of arbitrariness in selecting the appropriate convex hull, construction of a PBNO preconditioner for the 2-D DG model utilizes precisely the same objective NLLS algorithm as for the CG model. As in the CG model, the PBNO preconditioner achieves significant reduction in GMRES iteration counts and model wall-clock time. Comparisons of the ability of the PBNO preconditioner to improve CG and DG model performance when employing the Stabilized Biconjugate Gradient algorithm (BICGS) and the basic Richardson (RICH) iteration are also included. In particular, we show that higher order PBNO preconditioning of the Richardson iteration (which is run in a dot product free mode) makes the algorithm competitive with GMRES and BICGS in a serial computing environment, especially when employed in a DG model. Because the NLLS-based algorithm used to construct the PBNO preconditioner can handle both positive definite and complex spectra without any need for algorithm modification, we suggest that the PBNO preconditioner is, for certain types of problems, an attractive alternative to existing polynomial preconditioners based on linear least-squares methods.
منابع مشابه
Polynomial-Based Nonlinear Least Squares Optimized Preconditioning and its Application to Continuous and Discontinuous Element-Based Discretizations of the Euler Equations
We introduce a method for constructing a polynomial preconditioner using a nonlinear least squares (NLLS) algorithm. We show that this polynomial-based NLLS-optimized (PBNO) preconditioner significantly improves the performance of 2-D continuous Galerkin (CG) and discontinuous Galerkin (DG) compressible Euler equation models when run in an implicit-explicit time integration mode. When employed ...
متن کاملMatrix-Free Polynomial-Based Nonlinear Least Squares Optimized Preconditioning and Its Application to Discontinuous Galerkin Discretizations of the Euler Equations
We introduce a preconditioner that can be both constructed and applied using only the ability to apply the underlying operator. Such a preconditioner can be very attractive in scenarios where one has a highly efficient parallel code for applying the operator. Our method constructs a polynomial preconditioner using a nonlinear least squares (NLLS) algorithm. We show that this polynomial-based NL...
متن کاملAn Element-Based Spectrally Optimized Approximate Inverse Preconditioner for the Euler Equations
We introduce a method for constructing an element-by-element sparse approximate inverse (SAI) preconditioner designed to be effective in a massively-parallel spectral element modeling environment involving nonsymmetric systems. This new preconditioning approach is based on a spectral optimization of a low-resolution preconditioned system matrix (PSM). We show that the local preconditioning matr...
متن کاملAn Implicit Hermite WENO Reconstruction-Based Discontinuous Galerkin Method on Tetrahedral Grids
An Implicit Reconstructed Discontinuous Galerkin method, IRDG(P1P2), is presented for solving the compressible Euler equations on tetrahedral grids. In this method, a quadratic polynomial (P2) solution is first reconstructed using a least-squares method from the underlying linear polynomial (P1) DG solution. By taking advantage of the derivatives in the DG formulation, the stencils used in the ...
متن کاملFast Solvers for Models of Fluid Flow with Spectral Elements
Title of dissertation: FAST SOLVERS FOR MODELS OF FLUID FLOW WITH SPECTRAL ELEMENTS P. Aaron Lott, Doctor of Philosophy, 2008 Dissertation directed by: Professor Howard Elman Department of Computer Science Institute for Advanced Computer Studies & Associate Research Professor Anil Deane Institute for Physical Sciences and Technology We introduce a preconditioning technique based on Domain Decom...
متن کامل